Non-Resolution Theorem Proving
نویسنده
چکیده
This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Examples are given and suggestions are made for future work.
منابع مشابه
Non-clausal Resolution Theorem Proving for Description Logic
The article presents refutational resolution theorem proving system for Description Logic (DL) based on general (non-clausal) resolution rule. There is also presented unification algorithm handling existentiality without the need of skolemization in first-order logic. Its idea follows from general resolution with existentiality for first-order logic. When the prover is constructed it provides t...
متن کاملNon-clausal Resolution Theorem Proving for Fuzzy Predicate Logic
The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without the need of skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constru...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملTheory Exploration with Theorema
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, n...
متن کاملA Theory of Resolution
We review the fundamental resolution-based methods for rst-order theorem proving and present them in a uniform framework. We show that these calculi can be viewed as specializations of non-clausal resolution with simpli cation. Simpli cation techniques are justi ed with the help of a rather general notion of redundancy for inferences. As simpli cation and other techniques for the elimination of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 9 شماره
صفحات -
تاریخ انتشار 1977